Line hypergraphs
نویسندگان
چکیده
منابع مشابه
Partial line directed hypergraphs
The partial line digraph technique was introduced in [7] in order to construct digraphs with a minimum diameter, maximum connectivity, and good expandability. To find a new method to construct directed hypergraphs with a minimum diameter, we present in this paper an adaptation of that technique to directed hypergraphs. Directed hypergraphs are used as models for interconnection networks whose v...
متن کاملDISCRETE MATHEMATICS Line hypergraphs
In this paper, we introduce a new multivalued function ~ called the line hypergraph. The function ~ generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorems on line graphs can be unified and their more general versions can be obtained. Three such theorems are considered here, namely, the Berge theorem...
متن کاملLine Directed Hypergraphs
In this article we generalize the concept of line digraphs to line dihypergraphs. We give some general properties in particular concerning connectivity parameters of dihypergraphs and their line dihypergraphs, like the fact that the arc connectivity of a line dihypergraph is greater than or equal to that of the original dihypergraph. Then we show that the De Bruijn and Kautz dihypergraphs (whic...
متن کاملOn-Line Algorithms for 2-Coloring Hypergraphs Via Chip Games
Erdös has shown that for all k-hypergraphs with fewer than 2k−1 edges, there exists a 2-coloring of the nodes so that no edge is monochromatic. Erdös has also shown that when the number of edges is greater than k2, there exist k-hypergraphs with no such 2-coloring. These bounds are not constructive, however. In this paper, we take an “on-line” look at this problem, showing constructive upper an...
متن کاملdecomposing hypergraphs into k-colorable hypergraphs
for a given hypergraph $h$ with chromatic number $chi(h)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${e_1,e_2,ldots,e_l}$ for $e(h)$, such that the hypergraph induced by $e_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(h) rceil$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00233-m